d-Regular Graphs of Acyclic Chromatic Index
نویسندگان
چکیده
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a′(G). It was conjectured by Alon, Sudakov and Zaks (and earlier by Fiamcik) that a′(G)≤ +2, where = (G) denotes the maximum degree of the graph. Alon et al. also raised the question whether the complete graphs of even order are the only regular graphs which require +2 colors to be acyclically edge colored. In this article, using a simple counting argument we observe not only that this is not true, but in fact all d-regular graphs with 2n vertices and d>n, requires at least d+2 colors. We also show that a′(Kn,n)≥n+2, when n is odd using a more non-trivial argument. (Here Kn,n denotes the complete bipartite graph with n vertices on each side.) This lower bound for Kn,n can be shown to be tight for some families of complete bipartite graphs and for small values Journal of Graph Theory 2009 Wiley Periodicals, Inc.
منابع مشابه
A new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملd-Regular graphs of acyclic chromatic index at least d+2
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a(G). It was conjectured by Alon, Sudakov and Zaks (and earlier by Fiamcik) that a(G) ≤ ∆ + 2, where ∆ = ∆(G) denotes the maximum degree of the graph. A...
متن کاملThe generalised acyclic edge chromatic number of random regular graphs
The r-acyclic edge chromatic number of a graph is defined to be the minimum number of colours required to produce an edge colouring of the graph such that adjacent edges receive different colours and every cycle C has at least min(|C|, r) colours. We show that (r − 2)d is asymptotically almost surely (a.a.s.) an upper bound on the r-acyclic edge chromatic number of a random d-regular graph, for...
متن کاملAcyclic edge coloring of subcubic graphs
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using 5 colors. This result is tight since there are...
متن کاملThe generalized acyclic edge chromatic number of random regular graphs
The r-acyclic edge chromatic number of a graph is defined to be the minimum number of colours required to produce an edge colouring of the graph such that adjacent edges receive different colours and every cycle C has at least min(|C|, r) colours. We show that (r − 2)d is asymptotically almost surely (a.a.s.) an upper bound on the r-acyclic edge chromatic number of a random d-regular graph, for...
متن کامل